BFS Solution for Disjoint Paths in P Systems
نویسندگان
چکیده
This paper continues the research on determining a maximum cardinality set of edgeand node-disjoint paths between a source cell and a target cell in P systems. We review the previous solution [3], based on depth-first search (DFS), and we propose a faster solution, based on breadth-first search (BFS), which leverages the parallel and distributed characteristics of P systems. The runtime complexity shows that, our BFSbased solution performs better than the DFS-based solution, in terms of P steps.
منابع مشابه
Reliability assessment of power distribution systems using disjoint path-set algorithm
Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...
متن کاملOPTIMALIZATION PHASE USING GRAPH MODELLING FOR RELIABLE BUILDING COMPLEXES
During the planning phase of modern, complex, block-structured, large-area located, but still landscape-harmonized health-care buildings, the key is the optimal positioning of the blocks and functions, simultaneously ensuring the most-effective backup-paths for any transportation route failure in the buildings in order to speed up system operation, reduce maintenance costs and especially to imp...
متن کاملConstructing Pairwise Disjoint Paths with
Let P be a simple polygon and let f(ui; u 0 i)g be m pairs of distinct vertices of P where for every distinct i; j m, there exist pairwise disjoint paths connecting ui to u 0 i and uj to u 0 j. We wish to construct m pairwise disjoint paths in the interior of P connecting ui to u 0 i for i = 1; : : : ; m, with minimal total number of line segments. We give an approximation algorithm which in O(...
متن کاملA Set-to-Set Disjoint Paths Routing Algorithm in a Torus-Connected Cycles Network
Torus-Connected Cycles (TCC) have been recently proposed as interconnection network for massively parallel systems. In order to increase system dependability and interprocessor communication performance, disjoint paths routing is critical. In this paper, we focus on the set-to-set disjoint paths routing problem which consists in select mutually node-disjoint paths between two sets of nodes. As ...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011